Generating hard and diverse test sets for NP-hard graph problems
نویسندگان
چکیده
منابع مشابه
NP-hard graph problems and boundary classes of graphs
Any graph problem, which is NP-hard in general graphs, becomes polynomial-time solvable when restricted to graphs in special classes. When does a difficult problem become easy? To answer this question we study the notion of boundary classes. In the present paper we define this notion in its most general form, describe several approaches to identify boundary classes and apply them to various gra...
متن کاملLecture 29: Np-hard Problems [fa'12] 29 Np-hard Problems 29.1 'efficient' Problems
A generally-accepted minimum requirement for an algorithm to be considered ‘efficient’ is that its running time is polynomial: O(nc) for some constant c, where n is the size of the input.1 Researchers recognized early on that not all problems can be solved this quickly, but we had a hard time figuring out exactly which ones could and which ones couldn’t. there are several so-called NP-hard prob...
متن کاملGenerating Hard Satisfiability Problems
We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite diffi...
متن کاملNP-Hard Triangle Packing Problems
In computational geometry, packing problems ask whether a set of rigid pieces can be placed inside a target region such that no two pieces overlap. The triangle packing problem is a packing problem that involves triangular pieces, and it is crucial for algorithm design in many areas, including origami design, cutting industries, and warehousing. Previous works in packing algorithms have conject...
متن کاملNP-Hard Module Rotation Problems
Preplaced circuit modules may be rotated to improve performance and/or routability. We show that several simple versions of the module rotation problem are NP-hard.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)e0140-t